A Constraint Programming Model for the B-Coloring Problem

B-coloring is a theoretical optimization problem on graph that, top of being used to model some real-world applications, exploited by bounding techniques embedded into solvers for the classical coloring problem. This implies that improved solutions b-coloring have an impact even larger pool practical applications modelled in several different fields such as scheduling, timetabling and telecommunications. The aims maximize number colors provide complete G = (V,E), while preventing adjacent vertices from receiving same color. Moreover, each color associated so-called b-vertex. A vertex can be b-vertex only if set assigned its includes all used, apart one itself. In this work we discuss new Constraint Programming show how paradigm improve state-of-the-art results benchmarks instances commonly adopted literature.